Towards classifying propositional probabilistic logics

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards classifying propositional probabilistic logics

Probabilistic logics are commonly designed by adding probabilistic operators and their semantics to a logical system. There are several axes in which one might classify probabilistic logics, depending on syntactic and semantic design decisions. By using classical propositional logic as a starting ground, the present work aims at shedding some light on which choices are relevant when classifying...

متن کامل

Probabilistic Propositional Temporal Logics

We present two (closely-related) propositional probabilistic temporal logics based on temporal logics of branching time as introduced The first logic, PTLf, is interpreted over finite models, while the second logic, PTLb, which is an extension of the first one, is interpreted over infinite models with transition probabilities bounded away from O. The logic PTLf allows us to reason about finite-...

متن کامل

Towards Activity Recognition Using Probabilistic Description Logics

A major challenge of pervasive context-aware computing and intelligent environments resides in the acquisition and modelling of rich and heterogeneous context data. Decisive aspects of this information are the ongoing human activities at different degrees of granularity. We conjecture that ontology-based activity models are key to support interoperable multilevel activity representation and rec...

متن کامل

Towards Determining the Subset Relation between Propositional Modal Logics

We present design and implementation of a system that tries to automatically determine the subset relation between two given axiomatizations of almost arbitrary propositional modal logics, which is an open challenge problem for automated theorem proving. A test suite shows that relatively simple strategies can lead to satisfactory results, but also that certain subproblems are hard for current ...

متن کامل

Compact Propositional Gödel Logics

Entailment in propositional Gödel logics can be defined in a natural way. While all infinite sets of truth values yield the same sets of tautologies, the entailment relations differ. It is shown that there is a rich structure of infinite-valued Gödel logics, only one of which is compact. It is also shown that the compact infinite-valued Gödel logic is the only one which interpolates, and the on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Logic

سال: 2014

ISSN: 1570-8683

DOI: 10.1016/j.jal.2014.01.005